0 Explicit Formulas for the Multivariate Resultant

نویسنده

  • ALICIA DICKENSTEIN
چکیده

We present formulas for the multivariate resultant as a quotient of two determinants. They extend the classical Macaulay formulas, and involve matrices of considerably smaller size, whose non zero entries include coefficients of the given polynomials and coefficients of their Bezoutian. These formulas can also be viewed as an explicit computation of the morphisms and the determinant of a resultant complex.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The resultant on compact Riemann surfaces

We introduce a notion of resultant of two meromorphic functions on a compact Riemann surface and demonstrate its usefulness in several respects. For example, we exhibit several integral formulas for the resultant, relate it to potential theory and give explicit formulas for the algebraic dependence between two meromorphic functions on a compact Riemann surface. As a particular application, the ...

متن کامل

Resultants and Chow Forms via Exterior Syzygies

Let W be a vector space of dimension n+ 1 over a field K. The Chow divisor of a k-dimensional variety X in P = P(W ) is the hypersurface, in the Grassmannian Gk+1 of planes of codimension k+1 in P, whose points (over the algebraic closure of K) are the planes that meet X . The Chow form of X is the defining equation of the Chow divisor. For example, the resultant of k+ 1 forms of degree e in k ...

متن کامل

The resultant of an unmixed bivariate system

This paper gives an explicit method for computing the resultant of any sparse unmixed bivariate system with given support. We construct square matrices whose determinant is exactly the resultant. The matrices constructed are of hybrid Sylvester and Bézout type. The results extend those in [14] by giving a complete combinatorial description of the matrix. Previous work by D’Andrea [5] gave pure ...

متن کامل

Fast Computation of the Bezout and Dixon Resultant Matrices

Efficient algorithms are derived for computing the entries of the Bezout resultant matrix for two univariate polynomials of degree n and for calculating the entries of the Dixon–Cayley resultant matrix for three bivariate polynomials of bidegree (m, n). Standard methods based on explicit formulas require O(n3) additions and multiplications to compute all the entries of the Bezout resultant matr...

متن کامل

Taylor series based two-dimensional digital differentiators

A new type of Taylor series based 2-D finite difference approximation is presented, and it is shown that the coefficients of these approximations are not unique. Explicit formulas are presented for one of the possible sets of coefficients for an arbitrary order, by extending the previously presented 1-D approximations. These coefficients are implemented as maximally linear 2-D FIR digital diffe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000